A State-Efficient Zebra-Like Implementation of Synchronization Algorithms for 2D Rectangular Cellular Arrays

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

State-efficient Time-optimum Synchronization Protocols for Two-dimensional Arrays -A Survey-

The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we give a survey on recent developments in firing squad synchronization algorithms for synchronizing large-scale two-dimensional cellular automata. Several new algorithms and their stateefficient implementatio...

متن کامل

Efficient Algorithms for Sorting and Synchronization

This thesis presents efficient algorithms for internal and external parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on highly efficient but incorrect algorithms followed by a cleanup phase that completes the sort. The remote data update algorithm, rsync, operates by exchanging block signature information followed by a simple hash searc...

متن کامل

Two-Dimensional Cellular Automata Synchronizers

We study a firing squad synchronization problem that gives a finite-state protocol for synchronizing large-scale cellular automata. In this paper, we give a survey on recent developments in designing optimumand non-optimum-time synchronization algorithms and present their state-efficient implementations for two-dimensional cellular arrays. Several simple, state-efficient mapping schemes are pro...

متن کامل

Transversals of Rectangular Arrays

The paper deals with m by n rectangular arrays whose mn cells are filled with symbols. A section of the array consists of m cells, one from each row and no two from the same column. The paper focuses on the existence of sections that do contain symbols with high multiplicity.

متن کامل

Efficient Parallel Simulations of Asynchronous Cellular Arrays

A b str act. A defin itio n for a class of asy nch ronous ce llular arrays is proposed. An exa mp le of such asy nchrony woul d be indep endent Poisson arr ivals of cell iterat ions . The Ising model in the continuous time formulation of G lauber falls into t his class. Also proposed are efficient pa ra llel algorithms for simula ting these asynchronous cellular arrays. In t he algorithms , one...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BIOMATH

سال: 2012

ISSN: 1314-7218,1314-684X

DOI: 10.11145/j.biomath.2012.09.023